#include "BinaryTree.h"
using namspace std;

#include <stdlib.h>

#define MAXN 10

int main(int argc, char *argv[]){
	Node<int> n;
	n.setElement(5);
	cout << n.element <<endl;
	BinarySearchTree<int> a;
	AvlTree<int> b;
	int i = 0;
	for ( i = MAXN; i > 0; i --){
	       a.push_back(i);
	       b.push_back(i);
	}
	printTree(a);
	printTree(b);
}
